翻訳と辞書 Words near each other ・ Renée Weibel ・ Renée Zellweger ・ Renê Júnior ・ Renê Nazare ・ Renê Weber ・ Renārs Kaupers ・ Renārs Rode ・ Renāte Fedotova ・ Renāte Lāce ・ Renče ・ Renčišov ・ Rențea River ・ REO ・ Reo (deity) ・ Reo Brothers ・ Reo Coordination Language ・ Reo Fortune ・ Reo Jones ・ Reo Mochizuki ・ REO Motor Car Company ・ Reo Purgyil ・ REO Speed Wagon ・ REO Speedwagon ・ REO Speedwagon discography ・ Reo Stakis ・ REO Town ・ Reo Wilde ・ Reo, Estonia ・ Reo, Indiana ・ Reoccurring Dream Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Reo Coordination Language ： ウィキペディア英語版 Reo Coordination Language Reo〔Farhad Arbab: (Reo: a channel-based coordination model for component composition ). Mathematical Structures in Computer Science 14(3):329--366, 2004.〕〔Farhad Arbab: (Puff, The Magic Protocol ). In Gul Agha, Olivier Danvy, Jose Meseguer, editors, Talcott Festschrift, volume 7000 of LNCS, pages 169-206. Springer, 2011.〕 is a domain-specific language for programming and analyzing coordination protocols that compose individual ''processes'' into full ''systems'', broadly construed. Examples of classes of systems that can be composed with Reo include component-based systems, service-oriented systems, multithreading systems, biological systems, and cryptographic protocols. Reo has a graphical syntax in which every Reo program, called a ''connector'' or ''circuit'', is a labeled directed hypergraph. Such a graph represents the data-flow among the processes in the system. Reo has formal semantics, which stand at the basis of its various formal verification techniques and compilation tools. == Definitions == In Reo, a concurrent system consists of a set of components which are glued together by a circuit that enables flow of data between components. Components can perform I/O operations on the ''boundary nodes'' of the circuit to which they are connected. There are two kinds of I/O operations: put-requests dispatch data items to a node, and get-requests fetch data items from a node. All I/O operations are blocking, which means that a component can proceed only after its pending I/O operation has been successfully processed. The figure on the top-right shows an example of a producers-consumer system with three components: two producers on the left and one consumer on the right. The circuit in the middle defines the protocol, which states that the producers should send data synchronously, while the consumer receives those data in alternating order. Formally, the structure of a circuit is defined as follows: Definition 1. A ''circuit'' is a triple $R\; =\; (N,\; B,\; C,\; t)$ where: # $N$ is a set of ''nodes''; # $B\; \backslash subseteq\; N$ is a set of ''boundary nodes''; # $C\; \backslash subseteq\; 2^N\; \backslash times\; 2^N$ is a set of ''channels''; # $t\; :\; C\; \backslash rightarrow\; T$ assigns a ''types'' to every channel. such that $|I\; \backslash cup\; O|\; =\; 2$, for all $(I,O)\; \backslash in\; C$. If $c\; =\; (I,O)\; \backslash in\; C$ is a channel, then $I$ is called the set of input nodes of $c$ and $O$ is called the set of output nodes of $c$. The dynamics of a circuit resemble the flow of signals through an electronic circuit. Nodes have fixed merger-replicator behavior: the data of one of the incoming channels is propagated to all outgoing channels, without storing or altering the data (i.e., replicator behavior). If multiple incoming channels can provide data, the node makes a nondeterministic choice among them (i.e., merger behavior). Nodes with only incoming or outgoing channels are called ''sink nodes'' or ''source nodes'', respectively; nodes with both incoming and outgoing channels are called ''mixed nodes''. In contrast to nodes, channels have user-defined behavior represented by their type. This means that channels may store or alter data items that flow through them. Although every channel connects exactly two nodes, these nodes need not to be input and output. For instance, the vertical channel in the figure on the top-right has two inputs and no outputs. The channel type defines the behavior of the channel with respect to data. Below is a list of common types: * Sync: Atomically gets data from its input node and propagates it to its output node. * LossySync: Same as Sync, but can lose data if its output node is not ready to take data. * Fifo$\backslash langle\; n\backslash rangle$: Gets data from its input node, temporarily stores it in an internal buffer of size $n$, and propagates it to its output node (whenever this output node is ready to take data). * SyncDrain: Atomically gets data from both its input nodes and loses it. * Filter$\backslash langle\; c\backslash rangle$: Atomically gets data from its input node and propagates it to its output node if the filter condition $c$ is satified; loses the data otherwise. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Reo Coordination Language」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.